Termination w.r.t. Q proof of TRS/nontermin/CSREx1_2

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

2nd(cons(X, cons(Y, Z))) → Y
from(X) → cons(X, from(s(X)))

Q is empty.

↳ QTRS

  ↳ Overlay + Local Confluence

Q restricted rewrite system:
The TRS R consists of the following rules:

2nd(cons(X, cons(Y, Z))) → Y
from(X) → cons(X, from(s(X)))

Q is empty.

The TRS is overlay and locally confluent. By [15] we can switch to innermost.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

2nd(cons(X, cons(Y, Z))) → Y
from(X) → cons(X, from(s(X)))

The set Q consists of the following terms:

2nd(cons(x0, cons(x1, x2)))
from(x0)

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

FROM(X) → FROM(s(X))

The TRS R consists of the following rules:

2nd(cons(X, cons(Y, Z))) → Y
from(X) → cons(X, from(s(X)))

The set Q consists of the following terms:

2nd(cons(x0, cons(x1, x2)))
from(x0)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FROM(X) → FROM(s(X))

The TRS R consists of the following rules:

2nd(cons(X, cons(Y, Z))) → Y
from(X) → cons(X, from(s(X)))

The set Q consists of the following terms:

2nd(cons(x0, cons(x1, x2)))
from(x0)

We have to consider all minimal (P,Q,R)-chains.